Performance of the SDDS LH*LH under SDDS-2000

نویسنده

  • Fethi Bennour Sahli
چکیده

An SDDS contains data records. Every record is identified by a primary key or by several keys. Records are stored in buckets at server nodes called (SDDS) servers. They are manipulated from client nodes called (SDDS) clients. The key value(s) determines the address of the bucket where the record should be. An SDDS file starts at one storage site. Inserts scale the file incrementally through splits. Each split transfers half of records at a server data towards a new server allocated to the file. Splits are not posted to the SDDS clients. Each client uses for the record addressing an image of the file structure. Client images may differ. In particular, splits may render an image inaccurate. A client may then make an addressing error and send a key search or a record to an incorrect server.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IH* : A New Hash-Based Multidimensional SDDS

Classic one-dimensional data structures are very important. Nevertheless, the new data management systems (CAD, Web,..) need new access methods that support efficiently spatial operations on multi-attributes (multidimensional ) data files. Scalable Distributed Data Structures (SDDS) is a new class of data structures conceived specially for multicomputers: collection of PCs and workstations inte...

متن کامل

A Novel Architecture for Mobile Distributed Trie Hashing System

Scalable and Distributed Data Structures (SDDS) are a class of data structures completely dedicated to distributed environments. They allow the management of large amounts of data while maintaining steady and optimum performances. Several families of SDDS have been proposed: LH*, RP*, DRT*, CTH*. None of these SDDS deals with the mobile environment. In this paper we present a novel architecture...

متن کامل

LH*TH: New fast Scalable Distributed Data Structures (SDDS)

Proposed in 1993 the Scalable Distributed Data Structures (SDDSs) became a profile of basis for the data management on Multi computer. In this paper we propose an organization of a LH* bucket based on the trie hashing in order to improve times of different access request.

متن کامل

Deadlock and Livelock Free Concurrency Control by Value Dates for Scalable Distributed Data Structures

A Scalable Distributed Data Structure (SDDS) stores application data in a file transparently distributed over the nodes of a multi-computer, [LNS93]. The file consists of records identified each by a primary or a k-d key. Each storage node, the server node of the SDDS, stores the record in a bucket. The number of storage nodes, dynamically scales with the file size through the splits of the ove...

متن کامل

Scalable Storage for a DBMS using Transparent Distribution

Scalable Distributed Data Structures (SDDSs) provide a self-managing and self-organizing data storage of potentially unbounded size. This stands in contrast to common distribution schemas deployed in conventional distributed DBMS. SDDSs, however, have mostly been used in synthetic scenarios to investigate their properties. In this paper we concentrate on the integration of the LH* SDDS into our...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002